linear block coding造句
例句与造句
- study on linear block code
线性分组码问题研究 - linear block code
线性分组码 - absolute minimal trellis complexities of extended codes and their dual codes of two types of linear block codes whose code length is odd are given
给出了两类奇数码长线性分组码的扩展码及其对偶码的绝对最小网格图复杂度。 - although the estimation algorithm is carried out by parity check code, but it is also applicable in general linear block codes to estimate the channel ’ s parameter
本文算法不仅可以利用偶校验码的码结构去估计信道参数,而且对于一般的线性分组码也适用。 - the other is the modified hamming bound, also the geometry of the bound is introduced . the fourth chapter is about the linear block codes and their unequal error protection capability
第三章主要证明了两个关于非均匀保护的性能限，这两个性能限不仅对线性码有效，对非线性码同样有效。 - It's difficult to find linear block coding in a sentence. 用linear block coding造句挺难的
- among the linear block codes, rs code is an important one widely used in modern digital communications, which can correct both random and bursty errors with the most powerful error-correcting capability
rs码是一种典型的纠错码，在线性分组码中，它具有最强的纠错能力，既能纠正随机错误，也能纠正突发错误。 - ldpc ( low density parity check ) code is a kind of linear block code that defined by very sparse parity matrix or tanner graph, and it is also called gallager code since gallager initially presented it
ldpc(lowdensityparitycheck)码是一类用非常稀疏的校验矩阵或二分图定义的线性分组纠错码,最初由gallager发现,故亦称gallager码。 - the linear block code is called a binary low-density parity-check code if it is based on a sparse parity-check matrix . this sort of code was originally proposed by dr . gallager in 1962, which cannot attract a large amount of interest at that time
低密度奇偶校验(ldpc)码是基于稀疏校验矩阵的线性分组码,它最初由gallager于1962年提出,当时并未受到人们的重视。 - some results on the undetected error probability of linear codes for pure error-detection are, at present, generalized for both error detection and correction . an analytic formula is obtained to calculate the undetected error probability of linear block codes for simultaneous error detection and correction
在只检错时，证明了纠正两个错误扩展bch码是最佳检错码；m大于4的非线性等重码(2m，2，m)不是最佳码。 - being an important linear block code in error control field, the reed-solomon ( rs ) code has very strong capability of correcting random and burst errors, which is widely used in various modern communication systems to satisfy the requirement of channel reliability
rs(reed-solomon)码是差错控制领域中一类重要的线性分组码，由于具有很强的纠错能力，因而被广泛地应用于各种现代通信系统中，以满足对信道可靠性的要求。 - some properties of separation vector of linear block codes are shown, the relationship of a variety of codewords subspace and separation vector is derived, also a serie of theorems of parity check matrix and code symbol separation are proved . the singlton bound of separation is then proved
然后简单分析了线性码的码元分离度的性质，并在此基础上分析了一致校验矩阵的列相关性，从而得到了线性码的消息分离度和码元分离度的singlton限。 - ldpc code belongs to the linear block code which is encoded by the information sequence multiplies generator matrix . although the parity-check matrix of ldpc code is sparse, the generator matrix is not . the encoding complexity of it is linearly proportional to the square of code length
ldpc码属于线性分组码,线性分组码的通用编码方法是由信息序列根据码的生成矩阵来求相应的码字序列,尽管ldpc码的校验矩阵是非常稀疏的,但它的生成矩阵却并不稀疏,这使得其编码复杂度往往与其码长的平方成正比。 - in next mobile communication system to suffice more and more high-speed data service and demand of qos ( quality of service ) many new wireless link layer transport technologies are going to be used such as mimo ( multiple input multiple output ), ofdm ( orthogonal frequency division multiplexing ), channel coding and acm ( adaptive coding modulation ) etc . low density parity check ( ldpc ) codes were first discovered in 1960 ’ s which belong to linear block codes with their parity matrix being sparse
下一代移动通信系统为了满足移动用户对高速、宽带数据传输业务不断增长和更高服务质量的要求,采用了许多新的无线链路传输技术,包括多天线发射和接收技术、正交频分复用技术、信道纠错编码技术和自适应编码调制技术等。上世纪60年代提出的低密度校验码,是一种校验矩阵为稀疏矩阵的线性分组码。